Ant Algorithm for the Multidimensional Knapsack Problem
نویسندگان
چکیده
We propose a new algorithm based on the Ant Colony Optimization (ACO) meta-heuristic for the Multidimensional Knapsack Problem, the goal of which is to find a subset of objects that maximizes a given objective function while satisfying some resource constraints. We show that our new algorithm obtains better results than two other ACO algorithms on most instances.
منابع مشابه
Optimisation multi-objectif par colonies de fourmis : cas des problèmes de sac à dos. (Multi-objective ant colony optimization : case of knapsack problems)
In this thesis, we investigate the capabilities of Ant Colony Optimization (ACO) metaheuristic tosolve combinatorial and multi-objective optimization problems. First, we propose a taxonomy ofACO algorithms proposed in the literature to solve multi-objective problems. Then, we studydifferent pheromonal strategies for the case of mono-objective multidimensional knapsackproblem. We...
متن کاملHeuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP)
There are exact and heuristic algorithms for solving the MKP. Solution quality and time complexity are two main differences among exact and heuristic algorithms. Solution quality is a measure of how close we are from the optimal point and time complexity is a measure of the required time to reach such point. The purpose of this paper is to report the solution quality obtained from the evaluatio...
متن کاملFORM FINDING FOR RECTILINEAR ORTHOGONAL BUILDINGS THROUGH CHARGED SYSTEM SEARCH ALGORITHM
Preliminary layout design of buildings has a substantial effect on the ultimate design of structural components and accordingly influences the construction cost. Exploring structurally efficient forms and shapes during the conceptual design stage of a project can also facilitate the optimum integrated design of buildings. This paper presents an automated method of determining column layout desi...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کامل